Isomorphy up to complementation
نویسندگان
چکیده
منابع مشابه
Isomorphy up to complementation
Considering uniform hypergraphs, we prove that for every non-negative integer h there exist two non-negative integers k and t with k ≤ t such that two h-uniform hypergraphs H and H′ on the same set V of vertices, with ∣V ∣ ≥ t, are equal up to complementation whenever H and H′ are k-hypomorphic up to complementation. Let s(h) be the least integer k such that the conclusion above holds and let v...
متن کاملHypomorphy of graphs up to complementation
Let V be a set of cardinality v (possibly infinite). Two graphsG and G with vertex set V are isomorphic up to complementation if G is isomorphic to G or to the complement G of G. Let k be a non-negative integer, G and G are k-hypomorphic up to complementation if for every k-element subsetK of V , the induced subgraphs G↾K and G′↾K are isomorphic up to complementation. A graph G is k-reconstruct...
متن کاملThe solution to the cytological paradox of isomorphy
Cells with polyploid nuclei are generally larger than cells of the same organism or species with nonpolyploid nuclei. However, no such change of cell size with ploidy level is observed in those red algae which alternate isomorphic haploid with diploid generations. The results of this investigation reveal the explanation. Nuclear DNA content and other parameters were measured in cells of the fil...
متن کاملFrom Complementation to Certification
In the automata-theoretic approach to model checking we check the emptiness of the product of a system with an automaton for the complemented specification. This gives rise to two automata-theoretic problems: complementation of word automata, which is used in order to generate , and the emptiness problem, to which model checking is reduced. Both problems have numerous other applications, and ha...
متن کاملOn the Minimum Degree Up to Local Complementation: Bounds and Complexity
The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than √ p− 3 2 , which is, up to our knowledge, the highest kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2016
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2016.v7.n2.a5